Web Semantic-Based MOOP Algorithm for Facilitating Allocation Problems in the Supply Chain Domain

نویسندگان

چکیده

The facility allocation of the supply chain is critical since it directly influences cost efficiency, customer service, responsiveness, risk reduction, network optimization, and overall competitiveness. When enterprises deploy their facilities wisely, they may achieve operational excellence, exceed expectations, obtain a competitive advantage in today's volatile business climate. Due to this reason, multi-objective problem introduced research with cooperative-based multi-level backup coverage considering distance-based attractiveness. further described as two different layers process, where demand can be covered full, partial, no by respective facilities. main objectives are maximize simultaneously minimize cost.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semantic Web Solution for Supply Chain Management Problems

The WWW provides less expensive, more accessible technologies and communication infrastructures, speeding up the flow of information in supply chains. This paper presents a B2B architecture using Semantic Web technologies that allow for B2B relationships termed “Opportunistic Commerce.” The trucking industry is used to demonstrate how this technology finds business relationships producing advan...

متن کامل

Development of a Genetic Algorithm for Advertising Time Allocation Problems

Commercial advertising is the main source of income for TV channels and allocation of advertising time slots for maximizing broadcasting revenues is the major problem faced by TV channel planners. In this paper, the problem of scheduling advertisements on prime-time of a TV channel is considered. The problem is formulated as a multi-unit combinatorial auction based mathematical model. This is a...

متن کامل

A Genetic Algorithm Developed for a Supply Chain Scheduling Problem

This paper concentrates on the minimization of total tardiness and earliness of orders in an integrated production and transportation scheduling problem in a two-stage supply chain. Moreover, several constraints are also considered, including time windows due dates, and suppliers and vehicles availability times. After presenting the mathematical model of the problem, a developed version of GA c...

متن کامل

Using Electromagnetism Algorithm for Determining the Number of kanbans in a Multi-stage Supply Chain System

This paper studies the multi-stage supply chain system (MSSCM) controlled by the kanban mechanism. In the kanban system, decision making is based on the number of kanbans as well as batch sizes. A kanban mechanism is employed to assist in linking different production processes in a supply chain system in order to implement the scope of just-in-time (JIT) philosophy. For a MSSCM, a mixed-integer...

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal on Semantic Web and Information Systems

سال: 2023

ISSN: ['1552-6291', '1552-6283']

DOI: https://doi.org/10.4018/ijswis.330250